Fast and Efficient Coding of Low Entropy Sources with Two-sided Geometric Distribution
نویسنده
چکیده
We propose a method for efficient coding of sources with two-sided geometric distribution (TSGD) and entropy near to or less than 1 bit. This method is based on the binary tree decomposition of source symbols combined with binary arithmetic coding and allows for fast and efficient implementation. It can be used for coding of transform coefficients in low bit-rate video and image compression systems.
منابع مشابه
On Redundancy of Rice Coding
In this paper we derive the relative per-symbol redundancy of the Rice coding algorithm, which is a widely used technique in image compression for very fast entropy coding. We show, that for some important source models, such as the two-sided geometric distribution (TSGD), the redundancy depends on the source entropy H and it tends to zero if H → ∞. The redundancy is upper bounded by 50% if H → 0.
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملCoding of sources with two-sided geometric distributions and unknown parameters
Lossless compression is studied for a countably infinite alphabet source with an unknown, off-centered, two-sided geometric (TSG) distribution, which is a commonly used statistical model for image prediction residuals. In this paper, we demonstrate that arithmetic coding based on a simple strategy of model adaptation, essentially attains the theoretical lower bound to the universal coding redun...
متن کاملEntropy and Average Cost of AUH Codes
In this paper we address the class of anti-uniform Huffman (AUH) codes, named also unary codes, for sources with finite and infinite alphabet, respectively. Geometric, quasi-geometric, Fibonacci, exponential, Poisson, and negative binomial distributions lead to anti – uniform sources for some ranges of their parameters. Huffman coding of these sources results in AUH codes. We prove that as resu...
متن کاملOptimum design of a double-sided permanent magnet linear synchronous motor to minimize the detent force
In the permanent magnet linear synchronous motor (PMLSM), force ripple is harmful, useless and disturbing. The force ripple is basically composed of two components: detent force and mutual force ripple. This force is influenced by the geometric parameters of the permanent magnet (PM) motors; such as width, thickness and length of the magnet poles, length and thickness of the rotor and stato...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001